Eulerian tour algorithms for data visualization and the PairViz package
نویسندگان
چکیده
منابع مشابه
Eulerian tour algorithms for data visualization and the PairViz package
PairViz is an R package that produces orderings of statistical objects for visualization purposes. We abstract the ordering problem to one of constructing edge-traversals of (possibly weighted) graphs. PairViz implements various edge traversal algorithms which are based on Eulerian tours and Hamiltonian decompositions. We describe these algorithms, their PairViz implementation and discuss their...
متن کاملThe Stochastic Eulerian Tour Problem
This paper defines the Stochastic Eulerian Tour Problem (SETP) and investigates several characteristics of this problem. Given an undirected Eulerian graph , a subset =) of the edges in E that require service, and a probability distribution for the number of edges in R that have to be visited in any given instance of the graph, the SETP seeks an a priori Eulerian tour of minimum expected length...
متن کاملHeuristics for the Stochastic Eulerian Tour Problem
The Stochastic Eulerian Tour Problem (SETP) seeks the Eulerian tour of minimum expected length on an undirected Eulerian graph, when demand on the arcs that have to be serviced is probabilistic. In an earlier paper, we have shown that the SETP is NP-hard and derived several properties of the optimal tour. In this paper, we develop three constructive heuristics for the SETP. The first two are gr...
متن کاملA new approach for data visualization problem
Data visualization is the process of transforming data, information, and knowledge into visual form, making use of humans’ natural visual capabilities which reveals relationships in data sets that are not evident from the raw data, by using mathematical techniques to reduce the number of dimensions in the data set while preserving the relevant inherent properties. In this paper, we formulated d...
متن کاملTwo new heuristic algorithms for Covering Tour Problem
Covering Tour Problem (CTP) is the generalized form of Traveling Salesman Problem (TSP), which has found different applications in the designing of distribution networks, disaster relief, and transportation routing. The purpose of this problem is to determine the Hamiltoniancyclewiththe lowest costusinga subset of all the nodes, such that the other nodes would be in a distance shorter than the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Statistics
سال: 2011
ISSN: 0943-4062,1613-9658
DOI: 10.1007/s00180-011-0229-5